Batch queues with choice of arrivals: Equilibrium analysis and experimental study

Algorithmic Methods for Ph / Ph / 1 Queues with Batch Arrivals or Services

We discuss algorithms for the computation of the steady state features of PH/PH/l queues with bounded batch arrivals or batch services. Many characteristic quantities such as the mean and variance of queue length in continuous time, the mean waiting time, the waiting probability, etc. are obtained in computationaJIy tractable forms. We also show various numerical values.

Monotonicity properties of user equilibrium policies for parallel batch systems

We study a simple network with two parallel batch service queues, where service at a queue commences when the batch is full and each queue is served by infinitely many servers. A stream of general arrivals observe the current state of the system on arrival and choose which queue to join to minimize their own expected transit time. We show that for each set of parameter values there exists a uni...

Analysis of threshold-based batch-service queueing systems with batch arrivals and general service times

Most research concerning batch-service queueing systems has focussed on some specific aspect of the buffer content. Further, the customer delay has only been examined in the case of single arrivals. In this paper, we examine three facets of a threshold-based batch-service system with batch arrivals and general service times. First, we compute a fundamental formula from which an entire gamut of ...

Numerical analysis of queues with batch arrivals

An M/g/1 Retrial Queue with Unreliable Server and Vacations

In this paper, we consider retrial queueing systems with batch arrivals in which the server is subject to controllable interruptions (called vacations) and random interruptions (breakdowns). No specific assumption is taken regarding probability distributions of parametric random variables. The purpose of this work is to show effect of above mentioned parameters (in particular retrial and breakd...